Large Induced Outerplanar and Acyclic Subgraphs of Planar Graphs
نویسندگان
چکیده
Albertson and Berman [1] conjectured that every planar graph has an induced forest on half of its vertices; the current best result, due to Borodin [3], is an induced forest on two fifths of the vertices. We show that the Albertson-Berman conjecture holds, and is tight, for planar graphs of treewidth 3 (and, in fact, for any graph of treewidth at most 3). We also improve on Borodin’s bound for 2-outerplanar graphs by finding a large outerplanar induced subgraph and invoking Hosono’s result [9] that outerplanar graphs have large induced forests. Finally, we discuss potential extensions of this approach to k-outerplanar graphs and the related problem of the vertex arboricity of 2-outerplanar graphs.
منابع مشابه
Large induced acyclic and outerplanar subgraphs of low-treewidth planar graphs
Albertson and Berman conjectured that every planar graph has an induced forest on half of its vertices. The best known lower bound, due to Borodin, is that every planar graph has an induced forest on two fifths of its vertices. In a related result, Chartran and Kronk, proved that the vertices of every planar graph can be partitioned into three sets, each of which induce a forest. We show tighte...
متن کاملMaximum Weighted Induced Bipartite Subgraphs and Acyclic Subgraphs of Planar Cubic Graphs
We study the node-deletion problem consisting of finding a maximum weighted induced bipartite subgraph of a planar graph with maximum degree three. We show that this is polynomially solvable. It was shown in [4] that it is NP-complete if the maximum degree is four. We also extend these ideas to the problem of balancing signed graphs. We also consider maximum weighted induced acyclic subgraphs o...
متن کاملMinimum feedback vertex set and acyclic coloring
In the feedback vertex set problem, the aim is to minimize, in a connected graph G = (V ,E), the cardinality of the set V (G)⊆ V , whose removal induces an acyclic subgraph. In this paper, we show an interesting relationship between the minimum feedback vertex set problem and the acyclic coloring problem (which consists in coloring vertices of a graph G such that no two colors induce a cycle in...
متن کاملForbidden Subgraphs for Planar Blict and Blitact Graphs
Many graphs which are encountered in the study of graph theory are characterized by a type of configuration or subgraphs they possess. However, there are occasions when such graphs are more easily defined or described by the kind of subgraphs they are not permitted to contain. Such subgraphs are called forbidden subgraphs. In this paper, we present characterizations of graphs whose blict and bl...
متن کاملAcyclic edge coloring of 2-degenerate graphs
An acyclic edge coloring of a graph is a proper edge coloring such that there are no bichromatic cycles. The acyclic chromatic index of a graph is the minimum number k such that there is an acyclic edge coloring using k colors and is denoted by a′(G). A graph is called 2-degenerate if any of its induced subgraph has a vertex of degree at most 2. The class of 2-degenerate graphs properly contain...
متن کامل